#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
// b: 系数矩阵，c: 常数
double a[20][20], b[20], c[20][20];
int n;
int main() {
  cin >> n;
  for (int i = 1; i <= n + 1; ++i)
    for (int j = 1; j <= n; ++j) scanf("%lf", &a[i][j]);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      c[i][j] = 2 * (a[i][j] - a[i + 1][j]);
      b[i] += a[i][j] * a[i][j] - a[i + 1][j] * a[i + 1][j];
    }
  // 高斯消元
  for (int i = 1; i <= n; ++i) {
    // 找到 x[i] 的系数不为 0 的一个方程
    for (int j = i; j <= n; ++j) {
      if (fabs(c[j][i]) > eps) {
        for (int k = 1; k <= n; ++k) swap(c[i][k], c[j][k]);
        swap(b[i], b[j]);
      }
    }
    // 消去其它方程 x[i] 的系数
    for (int j = 1; j <= n; ++j) {
      if (i == j) continue;
      double rate = c[j][i] / c[i][i];
      for (int k = i; k <= n; ++k) c[j][k] -= c[i][k] * rate;
      b[j] -= b[i] * rate;
    }
  }
  for (int i = 1; i <= n; ++i) printf("%.3f ", b[i] / c[i][i]);
  printf("\n");
}
